Enumerative aspects of secondary structures
نویسندگان
چکیده
منابع مشابه
Enumerative aspects of secondary structures
A secondary structure is a planar, labeled graph on the vertex set {1; : : : ; n} having two kind of edges: the segments [i; i+1], for 16 i6 n− 1 and arcs in the upper half-plane connecting some vertices i; j, i6 j, where j− i ¿ l, for some :xed integer l. Any two arcs must be totally disjoint. We enumerate secondary structures with respect to their size n, rank l and order k (number of arcs), ...
متن کاملOn some enumerative aspects of generalized associahedra
We prove a conjecture of F. Chapoton relating certain enumerative invariants of (a) the cluster complex associated by S. Fomin and A. Zelevinsky to a finite root system and (b) the lattice of noncrossing partitions associated to the corresponding finite real reflection group. 1. The result Let Φ be a finite root system spanning an n-dimensional Euclidean space V with corresponding finite reflec...
متن کاملFundamental groups of line arrangements: Enumerative aspects
This is a survey of some recent developments in the study of complements of line arrangements in the complex plane. We investigate the fundamental groups and finite covers of those complements, focusing on homological and enumerative aspects. The unifying framework for this study is the stratification of the character variety of the fundamental group, G, by the jumping loci for cohomology with ...
متن کاملOntology Building using Parallel Enumerative Structures
The semantics of a text is carried by both the natural language it contains and its layout. As ontology building processes have so far taken only plain text into consideration, our aim is to elicit its textual structure. We focus here on parallel enumerative structures because they bear implicit or explicit hierarchical relations, they have salient visual properties, and they are frequently fou...
متن کاملEnumerative aspects of certain subclasses of perfect graphs
We investigate the enumerative aspects of various classes of perfect graphs like cographs, split graphs, trivially perfect graphs and threshold graphs. For subclasses of permutation graphs like cographs and threshold graphs we also determine the number of permutations of f1; 2; : : : ; ng such that the permutation graph G] belongs to that class. We establish an interesting bijec-tion between pe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.04.001